منابع مشابه
Incompleteness, Approximation and Relative Randomness
We present some results about the structure of c.e. and ∆2 LR-degrees. First we give a technique for lower cone avoidance in the c.e. and ∆2 LR-degrees, and combine this with upper cone avoidance via Sacks restraints to construct a c.e. LR-degree which is incomparable with a given intermediate ∆2 LR-degree. Next we combine measure-guessing with an LR-incompleteness strategy to construct an inco...
متن کاملFast Relative Approximation of Potential Fields
University of Paderborn, 33095 GERMANY; [email protected] Abstract. Multi-evaluation of the Coulomb potential induced by N particles is a central part of N -body simulations. In 3D, known subquadratic time algorithms return approximations up to given absolute precision. By combining data structures from Computational Geometry with fast polynomial arithmetic, the present work obtains approximations...
متن کاملRelative Error Tensor Low Rank Approximation
We consider relative error low rank approximation of tensors with respect to the Frobenius norm. Namely, given an order-q tensor A ∈ R ∏q i=1 ni , output a rank-k tensor B for which ‖A − B‖F ≤ (1 + ) OPT, where OPT = infrank-k A′ ‖A − A‖F . Despite much success on obtaining relative error low rank approximations for matrices, no such results were known for tensors. One structural issue is that ...
متن کاملNumerical Approximation of Relative Equilibria for Equivariant PDEs
We prove convergence results for the numerical approximation of relative equilibria of parabolic systems in one space dimension. These systems are are special examples of equivariant evolution equations. We use finite differences on a large interval with appropriately choosen boundary conditions. Moreover, we consider the approximation of isolated eigenvalues of finite multiplicity of the linea...
متن کاملFast Relative-Error Approximation Algorithm for Ridge Regression
Ridge regression is one of the most popular and effective regularized regression methods, and one case of particular interest is that the number of features p is much larger than the number of samples n, i.e. p n. In this case, the standard optimization algorithm for ridge regression computes the optimal solution x⇤ in O(n2p + n3) time. In this paper, we propose a fast relativeerror approximati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archiv der Mathematik
سال: 1974
ISSN: 0003-889X,1420-8938
DOI: 10.1007/bf01238642